Protein tertiary structure prediction using a branch and bound algorithm
نویسندگان
چکیده
منابع مشابه
Ab-Initio Protein Tertiary Structure Prediction Using Genetic Algorithm
Proteins are vital components of all living cells and play a critical role in almost all biological processes. Protein structure identification is a significant challenging problem in computational biology. The Protein's three-dimensional (i.e., tertiary) molecular structure reflects its proper function. Therefore, the identification of protein structure is a significant step towards understand...
متن کاملProtein Tertiary Structure Prediction Using Evolutionary Algorithms
In this paper, Protein Tertiary Structure Prediction using Evolutionary Algorithms (EAs) such as SelfAdaptive Differential Evolution (SaDE) and Real-coded Genetic Algorithm (RGA) are discussed. RGA is implemented with various crossover and mutation operators. The algorithms are tested on a peptide Metenkephalin. The energy functions used are ECEPP/2 and ECEPP/3 force fields. SaDE and RGA with d...
متن کاملA modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملIn Silico Prediction and Docking of Tertiary Structure of Multifunctional Protein X of Hepatitis B Virus
Hepatitis B virus (HBV) infection is a universal health problem and may result into acute, fulminant, chronic hepatitis liver cirrhosis, or hepatocellular carcinoma. Sequence for protein X of HBV was retrieved from Uniprot database. ProtParam from ExPAsy server was used to investigate the physicochemical properties of the protein. Homology modeling was carried out using Phyre2 server, and refin...
متن کاملBranch and Bound Algorithm Selection by Performance Prediction
We propose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Bound algorithm from among several promising ones. This method is based on Knuth’s sampling method which estimates the efficiency of a backtrack program on a particular instance by iteratively generating random paths in the search tree. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proteins: Structure, Function, and Genetics
سال: 1999
ISSN: 0887-3585,1097-0134
DOI: 10.1002/(sici)1097-0134(19990401)35:1<41::aid-prot5>3.0.co;2-n